Commute Times for a Directed Graph using an Asymmetric Laplacian
نویسندگان
چکیده
The expected commute times for a strongly connected directed graph are related to an asymmetric Laplacian matrix as a direct extension to similar well known formulas for undirected graphs. We show the close relationships between the asymmetric Laplacian and the so-called Fundamental matrix. We give bounds for the commute times in terms of the stationary probabilities for a random walk over the graph together with the asymmetric Laplacian and show how this can be approximated by a symmetrized Laplacian derived from a related weighted undirected graph.
منابع مشابه
Generalized Laplacians and First Transit Times for Directed Graphs
In this paper, we extend previous results on average commute-times for undirected graphs to fully-connected directed graphs, corresponding to irreducible Markov chains. We introduce an unsymmetrized generalized Laplacian matrix and show how its pseudo-inverse directly yields the one-way first-transit times and round-trip commute times with formulas almost matching those for the undirected graph...
متن کاملImage Segmentation using Commute Times
This paper exploits the properties of the commute time to develop a graphspectral method for image segmentation. Our starting point is the lazy random walk on the graph, which is determined by the heat-kernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the commute time between nodes, and show how this quantity may be computed ...
متن کاملHouseholder Symposium XVIII on Numerical Linear Algebra
s 6 Awad H. Al-Mohy An Improved Algorithm for the Matrix Logarithm . . . . . . . . . . . . . . . . . . . . 7 David Amsallem Interpolation on Matrix Manifolds of Reduced-Order Models and Application to On-Line Aeroelastic Predictions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Athanasios C. Antoulas Model Reduction of Parameter-Dependent Systems . . . . . . . . . . . . . . . . . . ...
متن کاملDigraph Laplacian and the Degree of Asymmetry
In this paper we extend and generalize the standard random walk theory (or spectral graph theory) on undirected graphs to digraphs. In particular, we introduce and define a (normalized) digraph Laplacian (in short, Diplacian) Γ for digraphs, and prove that 1) its Moore-Penrose pseudo-inverse is the (discrete) Green’s function of the Diplacian matrix (as an operator on digraphs), and 2) it is th...
متن کاملAffinity Measures Based on the Graph Laplacian
Several language processing tasks can be inherently represented by a weighted graph where the weights are interpreted as a measure of relatedness between two vertices. Measuring similarity between arbitary pairs of vertices is essential in solving several language processing problems on these datasets. Random walk based measures perform better than other path based measures like shortest-path. ...
متن کامل